A Novel Attribute Reduction Algorithm for Incomplete Information Systems Based on a Binary Similarity Matrix

نویسندگان

چکیده

With databases growing at an unrelenting rate, it may be difficult and complex to extract statistics by accessing all of the data in many practical problems. Attribute reduction, as effective method remove redundant attributes from massive data, has demonstrated its remarkable capability simplifying information systems. In this paper, we concentrate on reducing incomplete We introduce a novel definition binary similarity matrix present calculate significance correspondence. Secondly, develop heuristic attribute reduction algorithm using knowledge. addition, use numerical example showcase practicality accuracy algorithm. conclusion, demonstrate through comparative analysis that our outperforms some existing methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Attribute Reduction in Incomplete Information Systems

Through changing the equivalence relation of objects to reflexive and symmetric binary relation in the incomplete information system, a cumulative variable precision rough set model is proposed. The basic properties of β lower and β upper cumulative approximation operators are investigated. β upper, and β lower distribution consistent set are explored for defining β upper, and β lower distribut...

متن کامل

A Continuous Information Attribute Reduction Algorithm Based on Hierarchical Granulation

The attribute reduction algorithms based on neighborhood approximation usually use the distance as the approximate metric. Algorithms could result in the loss of information with the same distance threshold to construct the neighborhood families of different dimension spaces. Thereby, an attribute reduction algorithm based on hierarchical granulation is proposed. This algorithm can reduce redun...

متن کامل

Fast Algorithm for Attribute Reduction Based on Rough Set Theory Using Binary Discernibility Matrix

Rough set is a valid mathematical tool that deals with uncertain, vague and incomplete information of decision systems. Attribute reduction is one of the issues in rough set theory, and core attributes are indispensable in the process of attribute reduction. Recently, some researchers proposed the method of binary discernibility matrix to compute the results of attribute reduction, which can no...

متن کامل

Generalized Discernibility Function Based Attribute Reduction in Incomplete Decision Systems

A rough set approach for attribute reduction is an important research subject in data mining and machine learning. However, most attribute reduction methods are performed on a complete decision system table. In this paper, we propose methods for attribute reduction in static incomplete decision systems and dynamic incomplete decision systems with dynamically-increasing and decreasing conditiona...

متن کامل

A New Method of Attribute Reduction Based On Information Quantity in An Incomplete System

For an incomplete information system, attribute reduction is an important problem. To dealing with it, this paper proposed a new attribute reduction method based on information quantity. On one hand, this approach improved traditional tolerance relationship calculation methods using an extension of tolerance relationship in rough set theory. On the other hand, a new method was present for calcu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2023

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym15030674